Cut Problemsand Their Application to Divide-and-conquer
نویسنده
چکیده
Divide-and-conquer is one of the most basic techniques in thedesign and analysisof algorithms, and yet, until recently, therehavebeen essentially no performanceguaranteesknown for approximation algorithms based on this approach. This chapter will present approximation algorithmsfor several NPhard graph-theoretic cut problems, and their subsequent application asa tool for the “divide” part of divide-and-conquer approximation algorithms for a wide variety of problems.
منابع مشابه
Free Vibration Analysis of Repetitive Structures using Decomposition, and Divide-Conquer Methods
This paper consists of three sections. In the first section an efficient method is used for decomposition of the canonical matrices associated with repetitive structures. to this end, cylindrical coordinate system, as well as a special numbering scheme were employed. In the second section, divide and conquer method have been used for eigensolution of these structures, where the matrices are in ...
متن کاملOn the Granularity of Divide-and-Conquer Parallelism
This paper studies the runtime behaviour of various parallel divide-and-conquer algorithms written in a non-strict functional language, when three common granularity control mechanisms are used: a simple cut-off, a priority thread creation and a priority scheduling mechanism. These mechanisms use granularity information that is currently provided via annotations to improve the performance of th...
متن کاملDampvm/dac Programming, Tuning and Automatic Parallelization of Irregular Divide-and-conquer Applications in Programming, Tuning and Automatic Parallelization of Irregular Divide-and-conquer Applications in Dampvm/dac
This paper presents a new object oriented framework DAMPVM/DAC which is implemented on top of DAMPVM and provides automatic partitioning of irregular divide-andconquer (DAC) applications at runtime. The processes are then mapped dynamically to processors taking into account their speeds and even loads by other user processes. The paper presents the programming interface (API) of the framework, ...
متن کاملDivide-and-Conquer Minimal-Cut Bisectioning of Task Graphs
This paper proposes a method for partitioning the vertex set of an undirected simple weighted graph into two subsets so as to minimise the diierence of vertex-weight sums between the two subsets and the total weight of edges cut (i.e., edges with one end in each subset). The proposed heuristic algorithm works in a divide-and-conquer fashion and is a modiication of an algorithm suggested in the ...
متن کاملMultiple DNA Sequence Alignment Based on Genetic Algorithms and Divide-and-Conquer Techniques
Multiple DNA sequence alignment is one of the important research topics of bioinformatics. Because of the huge length of DNA sequences of advanced organisms, some researchers used divide-and-conquer techniques to cut the sequences for decreasing the space complexity for sequence alignment. Because the cutting points of sequences of the existing methods are fixed at the middle or the near-middle...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996